Transient handover blocking probabilities in road covering cellular mobile networks

This paper investigates handover and fresh call blocking probabilities for subscribers moving along a road in a traffic jam passing through consecutive cells of a wireless network. It is observed and theoretically motivated that the handover blocking probabilities show a sharp peak in the initial part of a traffic jam roughly at the moment when the traffic jam starts covering a new cell. The theoretical motivation relates handover blocking probabilities to blocking probabilities in the M/D/C/C queue with time-varying arrival rates. We provide a numerically efficient recursion for these blocking probabilities. \u

Monotonicity and error bounds for networks of Erlang loss queues

Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are (i) classical circuit switch telephone networks (loss networks) and (ii) present-day wireless mobile networks. Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it does not have one in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hypercubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to (1) upper bounds for loss probabilities and \ud (2) analytic error bounds for the accuracy of the approximation for various performance measures.\ud The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:\ud (1)• pure loss networks as under (2)• GSM networks with fixed channel allocation as under.\ud The results are of practical interest for computational simplifications and, particularly, to guarantee that blocking probabilities do not exceed a given threshold such as for network dimensioning

Cooperation in stochastic inventory models with continuous review

Consider multiple companies that continuously review their inventories and face Poisson demand. We study cooperation strategies for these companies and analyse if there exist allocations of the joint cost such that any company has lower costs than on its own; such allocations are called stable cost allocations. We start with two companies that jointly place an order for replenishment if their joint inventory position reaches a certain reorder level. This strategy leads to a simple expression of the joint costs. However, these costs exceed the costs for non-cooperating companies. Therefore, we examine another cooperation strategy. Namely, the companies reorder as soon as one of them reaches its reorder level. This latter strategy has lower costs than for non-cooperating companies. Numerical experiments show that the gametheoretical distribution rule — a cost allocation in which the companies share the procurement cost and each pays its own holding cost — is a stable cost allocation. These results also hold for situations with multiple companies

The invariant measure of homogeneous Markov processes in the quarter-plane: Representation in geometric terms

We consider the invariant measure of a homogeneous continuous-time Markov process in the quarter-plane. The basic solutions of the global balance equation are the geometric distributions. We first show that the invariant measure can not be a finite linear combination of basic geometric distributions, unless it consists of a single basic geometric distribution. Second, we show that a countable linear combination of geometric terms can be an invariant measure only if it consists of pairwise-coupled terms. As a consequence, we obtain a complete characterization of all countable linear combinations of geometric distributions that may yield an invariant measure for a homogeneous continuous-time Markov process in the quarter-plane

The Invariant Measure of Random Walks in the Quarter-plane: Representation in Geometric Terms

We consider the invariant measure of homogeneous random walks in the quarter-plane. In particular, we consider measures that can be expressed as a finite linear combination of geometric terms and present conditions on the structure of these linear combinations such that the resulting measure may yield an invariant measure of a random walk. We demonstrate that each geometric term must individually satisfy the balance equations in the interior of the state space and further show that the geometric terms in an invariant measure must have a pairwise-coupled structure. Finally, we show that at least one of the coefficients in the linear combination must be negative

A Linear Programming Approach to Error Bounds for Random Walks in the Quarter-plane

We consider the approximation of the performance of random walks in the quarter-plane. The approximation is in terms of a random walk with a product-form stationary distribution, which is obtained by perturbing the transition probabilities along the boundaries of the state space. A Markov reward approach is used to bound the approximation error. The main contribution of the work is the formulation of a linear program that provides the approximation error